An algorithm for converting an electrical circuit to a bond graph: a formalization of the inspection method

نویسندگان

  • Bruno Robisson
  • Jean-Gabriel Ganascia
چکیده

In this article, we show that the algorithm proposed by Karnopp and Rosenberg for converting a circuit into a bond graph is not fully adapted to the bond graph formalism. This formalism implicitly deletes information which is useless for describing the circuits' functioning. But this information is not systematically deleted in the bond graphs obtained with their algorithm. We propose an algorithm based on another of their method, called the inspection method. It was not yet formalized and allows to obtain bond graphs where the useless information is entirely deleted. This algorithm uses the Tutte decomposition of graphs and associates a unique bond graph with a given circuit.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A graph search algorithm: Optimal placement of passive harmonic filters in a power system

The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...

متن کامل

A New Highly Controllable and Accurate Algorithm for Defuzzifier Circuit Implementation

Defuzzifier circuit is one of the most important parts of fuzzy logic controllers that determine the output accuracy. The Center Of Gravity method (COG) is one of the most accurate methods that so far been presented for defuzzification. In this paper, a simple algorithm is presented to generate triangular output membership functions in the Mamdani method using the multiplier/divider circuit and...

متن کامل

Data Hiding Method Based on Graph Coloring and Pixel Block‘s Correlation in Color Image

An optimized method for data hiding into a digital color image in spatial domainis provided. The graph coloring theory with different color numbers is applied. To enhance thesecurity of this method, block correlations method in an image is used. Experimental results showthat with the same PSNR, the capacity is improved by %8, and also security has increased in themethod compared with other meth...

متن کامل

Optimal Multiple FCLs Allocation Considering DG Penetration in Meshed Network With Multi-Level Voltages

Increasing the short circuit current due to the penetration of distributed generations (DGs) in various voltage levels and meshed topology is a basic problem in power systems. Using fault current limiter (FCL) is an efficient approach to mitigate the exceeded short circuit levels. In this paper, a new approach is presented for multiple FCLs locating to decrease short circuit levels in meshed ne...

متن کامل

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018